Color-Swap Models for Non-growing Scale-free Networks
نویسندگان
چکیده
Introduction Non-growing scale-free networks represent an interesting class of complex networks. Compared to growing networks, which have been studied in many different scenarios with great success [1, 2, 3], they aim at modeling situations where a complex topology different from purely random is emerging but no growth process is present. There are many examples, mainly in biology (see [4] and the references therein), where instead of growth one can observe a self-organizing stochastic process which moves some network connections to different nodes, and the number of nodes and edges stays statistically bounded within some interval. Although various aspects of the dynamic behavior of non-growing (equilibrium) networks were well studied [5] and several stochastic process candidates have been proposed, they provide the scale-free property only under special conditions. The discrepancies between real networks and most model designs can be summarized as follows: (i) Multigraph: the processes in [5, 4] allow multiple edges and/or self-loops between the nodes, whereas in most real networks this phenomena does not exist. (ii) Connection (edge) growth: the process defined in [6] will reach a scale-free state only in certain range of the node degree distribution and also the number of edges grows considerably before it stabilizes. (iii) Condensation: the networks go through a scale-free state but later condensate to a state where a small fraction of nodes posses all the edges [5]. (iv) Structural constrains: the stochastic process defined in [4] reveals very interesting aspects, however the scale-free character is a result of structural constrains and special initial conditions. We present an edge-colored graph concept aimed at developing processes, generating non-growing scale-free networks, which would lack the disadvantages of the processes known so far; in particular, we propose a processes ”Color-Swap” which avoids the above mentioned problems (i), (ii), (iv) and improves on the problem (iii). A more detailed discussion and extensive experimental results we made available in [7].
منابع مشابه
Color-Swap models and other stochastic processes for non-growing scale-free networks
We present an experimental work and a concept based on complete, edge-colored graphs which goes towards the development of a non-growing scale-free process which would lack the disadvantages of the processes known so far i.e. a process that would i) stay in the class of simple graphs, ii) reach a scale-free degree distribution independently of the initial conditions, iii) have a constant number...
متن کاملComparing Prediction Power of Artificial Neural Networks Compound Models in Predicting Credit Default Swap Prices through Black–Scholes–Merton Model
Default risk is one of the most important types of risks, and credit default swap (CDS) is one of the most effective financial instruments to cover such risks. The lack of these instruments may reduce investment attraction, particularly for international investors, and impose potential losses on the economy of the countries lacking such financial instruments, among them, Iran. After the 2007 fi...
متن کاملهمگامسازی در مدل کوراموتو روی شبکههای پیچیده با توزیع فرکانس ذاتی دوقلهای
In this work, we study the Kuramoto model on scale-free, random and small-world networks with bimodal intrinsic frequency distributions. We consider two models: in one of them, the coupling constant of the ith oscillator is independent of the number of oscillators with which the oscillator interacts, and in the other one the coupling constant is renormalized with the number of oscillators with ...
متن کاملScale-free networks as pre-asymptotic regimes of super-linear preferential attachment
We study the following paradox associated with networks growing according to superlinear preferential attachment: superlinear preference cannot produce scale-free networks in the thermodynamic limit, but there are superlinearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet. We obtain an analytic solution, supported by extensive ...
متن کاملRecoverable prevalence in growing scale-free networks and the effective immunization
We study the persistent recoverable prevalence and the extinction of computer viruses via e-mails on a growing scale-free network with new users, which structure is estimated form real data. The typical phenomenon is simulated in a realistic model with the probabilistic execution and detection of viruses. Moreover, the conditions of extinction by random and targeted immunizations for hubs are d...
متن کامل